LCF considered as a programming language

Momega Considered as a Programming Language

Turing Completeness Considered Harmful: Component Programming with a Simple Language

Languages are increasingly being used to reuse computations as components as well as to express these computations in the first place. However, the expression of computations and component assembly have opposing language requirements: the former requires flexible Turing-complete constructs that can express many interactions while the latter benefits from constructs that instead hide interaction...

Nominal LCF: A Language for Generic Proof

The syntax and semantics of user-supplied hypothesis names in tactic languages is a thorny problem, because the binding structure of a proof is a function of the goal at which a tactic script is executed. We contribute a new language to deal with the dynamic and interactive character of names in tactic scripts called Nominal LCF, and endow it with a denotational semantics in dI-domains. A large...

Considered Both as a Paradigmatic Language and as a Meta-language

Intuitionistic Linear Logic (ILL) is a resource-conscious logic. The Curry-Howard Isomorphism (CHI) applied to ILL, generates typed functional-like languages that have primitive constants by means of which the amount of resources (terms), used during the computation, is explicit. ! is an untyped functional-like language inspired from a typed language joined at ILL by CHI. We want to use the res...

Java as a Functional Programming Language

We introduce a direct encoding of the typed λ-calculus into Java: for any Java types A, B we introduce the type A→ B together with function application and λ-abstraction. The latter makes use of anonymous inner classes. We show that λ-terms are evaluated by call-by-value. We then look at how to model domain equations in Java and as an example consider the untyped lambda calculus. Then we invest...